# ---
# title: 46. Permutations
# id: problem46
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Backtracking
# link: <https://leetcode.com/problems/permutations/description/>
# hidden: true
# ---
# 
# Given an array `nums` of distinct integers, return _all the possible
# permutations_. You can return the answer in **any order**.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: nums = [1,2,3]
#     Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: nums = [0,1]
#     Output: [[0,1],[1,0]]
#     
# 
# **Example 3:**
# 
#     
#     
#     Input: nums = [1]
#     Output: [[1]]
#     
# 
# 
# 
# **Constraints:**
# 
#   * `1 <= nums.length <= 6`
#   * `-10 <= nums[i] <= 10`
#   * All the integers of `nums` are **unique**.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
